-
1 магазинная память
1) Military: pushdown memory, stock memory2) Engineering: stack, stack memory3) Information technology: memory nesting memory, nesting memory, nondestructive (readout) memory nesting memory, push-down memory, push-down storage, wagon memory -
2 стек
1) General subject: riding crop, stack (единица объёма для дров и угля = 4 куб. ярдам = 3, 05 куб. м), stick, swagger cane, swagger stick2) Computers: push-down stack3) Colloquial: swagger-stick, swagger-cane4) Engineering: LIFO quetch (организация очереди по принципу "последний вошёл, первый вышел" (last in, first out)), last-in, first-out stack, stack memory (аппаратно-реализованный), push-down memory (аппаратно-реализованный), push-down storage (аппаратно-реализованный)5) British English: stack (ед. измерения уложенных в штабель дров. равная 3, 05 куб. м)7) Physics: refluxed8) Information technology: FILO, LIFO queue, nesting store (аппаратный), suit (протоколов), wagon memory, punch-down list, push-down list9) Astronautics: pushdown list, pushdown stack10) Food industry: flew down11) Patents: stack (запоминающее устройство магазинного типа) -
3 стек магазинного типа
1) Engineering: push-up memory (аппаратно-реализованный)2) Information technology: last-in first-out stack, push-down stack3) Programming: pushdown stackУниверсальный русско-английский словарь > стек магазинного типа
См. также в других словарях:
pushdown automaton — noun An automaton with finitely many states that also can use one unbounded stack of memory; the automaton may only push, pop, or read the top of the stack. Abbreviation: PDA … Wiktionary
Turing machine — For the test of artificial intelligence, see Turing test. For the instrumental rock band, see Turing Machine (band). Turing machine(s) Machina Universal Turing machine Alternating Turing machine Quantum Turing machine Read only Turing machine… … Wikipedia
automata theory — Body of physical and logical principles underlying the operation of any electromechanical device (an automaton) that converts information input in one form into another, or into some action, according to an algorithm. Norbert Wiener and Alan M.… … Universalium
Computability — You might be looking for Computable function, Computability theory, Computation, or Theory of computation. Computability is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Список терминов, относящихся к алгоритмам и структурам данных — Это служебный список статей, созданный для координации работ по развитию темы. Данное предупреждение не устанавливается на информационные списки и глоссарии … Википедия
Список терминов — Список терминов, относящихся к алгоритмам и структурам данных Это сл … Википедия
Deterministic context-free grammar — In formal grammar theory, the deterministic context free grammars (DCFGs) are a proper subset of the context free grammars. The deterministic context free grammars are those a deterministic pushdown automaton can recognize. A DCFG is the finite… … Wikipedia
Machine that always halts — In computability theory, a machine that always halts also called a decider (Sipser, 1996) or a total Turing machine (Kozen, 1997) is a Turing machine that halts for every input. Because it always halts, the machine is able to decide whether a… … Wikipedia
History of computing hardware — Computing hardware is a platform for information processing (block diagram) The history of computing hardware is the record of the ongoing effort to make computer hardware faster, cheaper, and capable of storing more data. Computing hardware… … Wikipedia
Computability theory (computer science) — In computer science, computability theory is the branch of the theory of computation that studies which problems are computationally solvable using different models of computation.Computability theory differs from the related discipline of… … Wikipedia
